Maximin Play in Two-Person Bimatrix Games
نویسندگان
چکیده
Since the seminal paper of Nash [7] game theoretic literature has focused mostly on equilibrium and not on maximin (minimax) strategies. We study the properties of these strategies in 2-player non-zero-sum strategic games, whose Nash equilibria are only mixed.
منابع مشابه
On the commitment value and commitment optimal strategies in bimatrix games
Given a bimatrix game, the associated leadership or commitment games are defined as the games at which one player, the leader, commits to a (possibly mixed) strategy and the other player, the follower, chooses his strategy after having observed the irrevocable commitment of the leader. Based on a result by von Stengel and Zamir [2010], the notions of commitment value and commitment optimal stra...
متن کاملOn Loss Aversion in Bimatrix Games
In this article three different types of loss aversion equilibria in bimatrix games are studied. Loss aversion equilibria are Nash equilibria of games where players are loss averse and where the reference points—points below which they consider payoffs to be losses— are endogenous to the equilibrium calculation. The first type is the fixed point loss aversion equilibrium, introduced in Shalev (...
متن کاملA symmetrization for finite two-person games
The symmetrization method of Gale, Kuhn and Tucker for matrix games is extended for bimatrix games. It is shown that the equilibria of a bimatrix game and its symmetrization correspond two by two. A similar result is found with respect to quasi-strong, regular and perfect equilibria.
متن کاملInformationally Robust Equilibria
Informationally Robust Equilibria (IRE) are introduced in Robson (1994) as a refinement of Nash equilibria for e.g. bimatrix games, i.e. mixed extensions of two person finite games. Similar to the concept of perfect equilibria, basically the idea is that an IRE is a limit of some sequence of equilibria of perturbed games. Here, the perturbation has to do with the hypothetical possibility that t...
متن کاملFe b 20 09 Is having a unique equilibrium robust ?
We investigate whether having a unique equilibrium (or a given number of equilibria) is robust to perturbation of the payoffs, both for Nash equilibrium and correlated equilibrium. We show that the set of n-player finite games with a unique correlated equilibrium is open, while this is not true of Nash equilibrium for n > 2. The crucial lemma is that a unique correlated equilibrium is a quasi-s...
متن کامل